<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>nih: octree/cuda/octree_builder_inline.h Source File</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>

</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">nih
   &#160;<span id="projectnumber">0.5</span>
   </div>
   
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Generated by Doxygen 1.7.5.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="modules.html"><span>Modules</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
    </ul>
  </div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
  initNavTree('octree__builder__inline_8h.html','');
</script>
<div id="doc-content">
<div class="header">
  <div class="headertitle">
<div class="title">octree/cuda/octree_builder_inline.h</div>  </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * Copyright (c) 2010-2011, NVIDIA Corporation</span>
<a name="l00003"></a>00003 <span class="comment"> * All rights reserved.</span>
<a name="l00004"></a>00004 <span class="comment"> *</span>
<a name="l00005"></a>00005 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00006"></a>00006 <span class="comment"> * modification, are permitted provided that the following conditions are met:</span>
<a name="l00007"></a>00007 <span class="comment"> *   * Redistributions of source code must retain the above copyright</span>
<a name="l00008"></a>00008 <span class="comment"> *     notice, this list of conditions and the following disclaimer.</span>
<a name="l00009"></a>00009 <span class="comment"> *   * Redistributions in binary form must reproduce the above copyright</span>
<a name="l00010"></a>00010 <span class="comment"> *     notice, this list of conditions and the following disclaimer in the</span>
<a name="l00011"></a>00011 <span class="comment"> *     documentation and/or other materials provided with the distribution.</span>
<a name="l00012"></a>00012 <span class="comment"> *   * Neither the name of NVIDIA Corporation nor the</span>
<a name="l00013"></a>00013 <span class="comment"> *     names of its contributors may be used to endorse or promote products</span>
<a name="l00014"></a>00014 <span class="comment"> *     derived from this software without specific prior written permission.</span>
<a name="l00015"></a>00015 <span class="comment"> *</span>
<a name="l00016"></a>00016 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS &quot;AS IS&quot; AND</span>
<a name="l00017"></a>00017 <span class="comment"> * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED</span>
<a name="l00018"></a>00018 <span class="comment"> * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE</span>
<a name="l00019"></a>00019 <span class="comment"> * DISCLAIMED. IN NO EVENT SHALL &lt;COPYRIGHT HOLDER&gt; BE LIABLE FOR ANY</span>
<a name="l00020"></a>00020 <span class="comment"> * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES</span>
<a name="l00021"></a>00021 <span class="comment"> * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;</span>
<a name="l00022"></a>00022 <span class="comment"> * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND</span>
<a name="l00023"></a>00023 <span class="comment"> * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT</span>
<a name="l00024"></a>00024 <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS</span>
<a name="l00025"></a>00025 <span class="comment"> * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00026"></a>00026 <span class="comment"> */</span>
<a name="l00027"></a>00027 
<a name="l00028"></a>00028 <span class="preprocessor">#include &lt;<a class="code" href="bintree__context_8h.html" title="Defines a simple binary tree context implementation to be used with the Bintree generate() function...">nih/bintree/cuda/bintree_context.h</a>&gt;</span>
<a name="l00029"></a>00029 <span class="preprocessor">#include &lt;nih/bintree/cuda/bintree_gen.h&gt;</span>
<a name="l00030"></a>00030 <span class="preprocessor">#include &lt;<a class="code" href="scan_8h.html" title="Define CUDA based scan primitives.">nih/basic/cuda/scan.h</a>&gt;</span>
<a name="l00031"></a>00031 <span class="preprocessor">#include &lt;nih/basic/utils.h&gt;</span>
<a name="l00032"></a>00032 <span class="preprocessor">#include &lt;<a class="code" href="morton_8h.html" title="Defines some general purpose algorithms.">nih/bits/morton.h</a>&gt;</span>
<a name="l00033"></a>00033 <span class="preprocessor">#include &lt;thrust/iterator/counting_iterator.h&gt;</span>
<a name="l00034"></a>00034 <span class="preprocessor">#include &lt;thrust/transform.h&gt;</span>
<a name="l00035"></a>00035 <span class="preprocessor">#include &lt;thrust/sort.h&gt;</span>
<a name="l00036"></a>00036 <span class="preprocessor">#include &lt;stack&gt;</span>
<a name="l00037"></a>00037 
<a name="l00038"></a>00038 <span class="keyword">namespace </span>nih {
<a name="l00039"></a>00039 
<a name="l00040"></a>00040 <span class="keyword">namespace </span>octree_builder { <span class="comment">// anonymous namespace</span>
<a name="l00041"></a>00041 
<a name="l00042"></a>00042 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Integer&gt;
<a name="l00043"></a><a class="code" href="structnih_1_1octree__builder_1_1_morton__bits.html">00043</a> <span class="keyword">struct </span><a class="code" href="structnih_1_1octree__builder_1_1_morton__bits.html">Morton_bits</a> {};
<a name="l00044"></a>00044 
<a name="l00045"></a>00045 <span class="keyword">template</span> &lt;&gt;
<a name="l00046"></a><a class="code" href="structnih_1_1octree__builder_1_1_morton__bits_3_01uint32_01_4.html">00046</a> <span class="keyword">struct </span><a class="code" href="structnih_1_1octree__builder_1_1_morton__bits.html">Morton_bits</a>&lt;uint32&gt; { <span class="keyword">static</span> <span class="keyword">const</span> uint32 value = 30u; };
<a name="l00047"></a>00047 
<a name="l00048"></a>00048 <span class="keyword">template</span> &lt;&gt;
<a name="l00049"></a><a class="code" href="structnih_1_1octree__builder_1_1_morton__bits_3_01uint64_01_4.html">00049</a> <span class="keyword">struct </span><a class="code" href="structnih_1_1octree__builder_1_1_morton__bits.html">Morton_bits</a>&lt;uint64&gt; { <span class="keyword">static</span> <span class="keyword">const</span> uint32 value = 60u; };
<a name="l00050"></a>00050 
<a name="l00051"></a>00051 <span class="keyword">typedef</span> <a class="code" href="structnih_1_1cuda_1_1_bintree__gen__context_1_1_split__task.html">cuda::Bintree_gen_context::Split_task</a> <a class="code" href="structnih_1_1cuda_1_1_bintree__gen__context_1_1_split__task.html">Split_task</a>;
<a name="l00052"></a>00052 <span class="keyword">typedef</span> <a class="code" href="structnih_1_1_bintree__node.html">Bintree_node</a> <a class="code" href="structnih_1_1_bintree__node.html">Kd_node</a>;
<a name="l00053"></a>00053 
<a name="l00055"></a><a class="code" href="structnih_1_1octree__builder_1_1_octree__collection.html">00055</a> <span class="keyword">struct </span><a class="code" href="structnih_1_1octree__builder_1_1_octree__collection.html" title="Utility class to hold results of an octree collection step.">Octree_collection</a>
<a name="l00056"></a>00056 {
<a name="l00057"></a>00057     uint32 node_count;
<a name="l00058"></a>00058     uint32 leaf_count;
<a name="l00059"></a>00059     uint32 bitmask;
<a name="l00060"></a>00060 };
<a name="l00061"></a>00061 
<a name="l00062"></a>00062 <span class="comment">// Helper class to collect the 8 children of a given node from</span>
<a name="l00063"></a>00063 <span class="comment">// a binary kd-tree structure.</span>
<a name="l00064"></a>00064 <span class="comment">// The class implements template based compile-time recursion.</span>
<a name="l00065"></a>00065 <span class="keyword">template</span> &lt;u<span class="keywordtype">int</span>32 LEVEL, u<span class="keywordtype">int</span>32 STRIDE&gt;
<a name="l00066"></a><a class="code" href="structnih_1_1octree__builder_1_1_octree__collector.html">00066</a> <span class="keyword">struct </span><a class="code" href="structnih_1_1octree__builder_1_1_octree__collector.html">Octree_collector</a>
<a name="l00067"></a>00067 {
<a name="l00068"></a>00068     <span class="keyword">static</span> NIH_HOST_DEVICE <span class="keywordtype">void</span> find_children(
<a name="l00069"></a>00069         <span class="keyword">const</span> uint32        node_index,
<a name="l00070"></a>00070         <span class="keyword">const</span> <a class="code" href="structnih_1_1_bintree__node.html">Kd_node</a>*      nodes,
<a name="l00071"></a>00071         <a class="code" href="structnih_1_1octree__builder_1_1_octree__collection.html" title="Utility class to hold results of an octree collection step.">Octree_collection</a>*  result,
<a name="l00072"></a>00072         uint32*             children,
<a name="l00073"></a>00073         <span class="keyword">const</span> uint32        octant = 0)
<a name="l00074"></a>00074     {
<a name="l00075"></a>00075         <span class="keyword">const</span> <a class="code" href="structnih_1_1_bintree__node.html">Kd_node</a> node = nodes[ node_index ];
<a name="l00076"></a>00076 
<a name="l00077"></a>00077         <span class="keyword">const</span> <span class="keywordtype">bool</span> active0 = node.<a class="code" href="structnih_1_1_bintree__node.html#a471bf83000ef72113a033539e19bf20b">has_child</a>(0);
<a name="l00078"></a>00078         <span class="keyword">const</span> <span class="keywordtype">bool</span> active1 = node.<a class="code" href="structnih_1_1_bintree__node.html#a471bf83000ef72113a033539e19bf20b">has_child</a>(1);
<a name="l00079"></a>00079 
<a name="l00080"></a>00080         <span class="keywordflow">if</span> ((active0 == <span class="keyword">false</span>) &amp;&amp; (active1 == <span class="keyword">false</span>))
<a name="l00081"></a>00081         {
<a name="l00082"></a>00082             <span class="comment">// here we have some trouble... this guy is likely not</span>
<a name="l00083"></a>00083             <span class="comment">// fitting within an octant of his parent.</span>
<a name="l00084"></a>00084             <span class="comment">// Which octant do we assign this guy to?</span>
<a name="l00085"></a>00085             <span class="comment">// Let&#39;s say the minimum...</span>
<a name="l00086"></a>00086             children[ STRIDE * result-&gt;node_count ] = node_index;
<a name="l00087"></a>00087             result-&gt;bitmask |= 1u &lt;&lt; (octant &lt;&lt; (3 - LEVEL));
<a name="l00088"></a>00088             result-&gt;node_count += 1;
<a name="l00089"></a>00089             result-&gt;leaf_count += 1;
<a name="l00090"></a>00090         }
<a name="l00091"></a>00091         <span class="keywordflow">else</span>
<a name="l00092"></a>00092         {
<a name="l00093"></a>00093             <span class="comment">// traverse the children in Morton order: preserving</span>
<a name="l00094"></a>00094             <span class="comment">// the order is key here, as we want the output counter</span>
<a name="l00095"></a>00095             <span class="comment">// to match the bitmask pop-counts.</span>
<a name="l00096"></a>00096             <span class="keywordflow">if</span> (active0)
<a name="l00097"></a>00097             {
<a name="l00098"></a>00098                 <a class="code" href="structnih_1_1octree__builder_1_1_octree__collector.html">Octree_collector&lt;LEVEL+1,STRIDE&gt;::find_children</a>(
<a name="l00099"></a>00099                     node.<a class="code" href="structnih_1_1_bintree__node.html#ac4859cefd9b6e3e3a27f1e850d1a4ad3">get_left</a>(),
<a name="l00100"></a>00100                     nodes,
<a name="l00101"></a>00101                     result,
<a name="l00102"></a>00102                     children,
<a name="l00103"></a>00103                     octant * 2 );
<a name="l00104"></a>00104             }
<a name="l00105"></a>00105             <span class="keywordflow">if</span> (active1)
<a name="l00106"></a>00106             {
<a name="l00107"></a>00107                 <a class="code" href="structnih_1_1octree__builder_1_1_octree__collector.html">Octree_collector&lt;LEVEL+1,STRIDE&gt;::find_children</a>(
<a name="l00108"></a>00108                     node.<a class="code" href="structnih_1_1_bintree__node.html#a2dd584ee8b3e54ff2488f66feb614fa5">get_right</a>(),
<a name="l00109"></a>00109                     nodes,
<a name="l00110"></a>00110                     result,
<a name="l00111"></a>00111                     children,
<a name="l00112"></a>00112                     octant * 2 + 1 );
<a name="l00113"></a>00113             }
<a name="l00114"></a>00114         }
<a name="l00115"></a>00115     }
<a name="l00116"></a>00116 };
<a name="l00117"></a>00117 <span class="comment">// Terminal node of Octree_collector&#39;s compile-time recursion.</span>
<a name="l00118"></a>00118 <span class="keyword">template</span> &lt;u<span class="keywordtype">int</span>32 STRIDE&gt;
<a name="l00119"></a><a class="code" href="structnih_1_1octree__builder_1_1_octree__collector_3_013_00_01_s_t_r_i_d_e_01_4.html">00119</a> <span class="keyword">struct </span><a class="code" href="structnih_1_1octree__builder_1_1_octree__collector.html">Octree_collector</a>&lt;3,STRIDE&gt;
<a name="l00120"></a>00120 {
<a name="l00121"></a>00121     <span class="keyword">static</span> NIH_HOST_DEVICE <span class="keywordtype">void</span> find_children(
<a name="l00122"></a>00122         <span class="keyword">const</span> uint32        node_index,
<a name="l00123"></a>00123         <span class="keyword">const</span> <a class="code" href="structnih_1_1_bintree__node.html">Kd_node</a>*      nodes,
<a name="l00124"></a>00124         <a class="code" href="structnih_1_1octree__builder_1_1_octree__collection.html" title="Utility class to hold results of an octree collection step.">Octree_collection</a>*  result,
<a name="l00125"></a>00125         uint32*             children,
<a name="l00126"></a>00126         <span class="keyword">const</span> uint32        octant)
<a name="l00127"></a>00127     {
<a name="l00128"></a>00128         <span class="comment">// we got to one of the octants</span>
<a name="l00129"></a>00129         children[ STRIDE * result-&gt;node_count ] = node_index;
<a name="l00130"></a>00130         result-&gt;bitmask |= 1u &lt;&lt; octant;
<a name="l00131"></a>00131         result-&gt;node_count += 1;
<a name="l00132"></a>00132 
<a name="l00133"></a>00133         <span class="keywordflow">if</span> (nodes[ node_index ].is_leaf())
<a name="l00134"></a>00134             result-&gt;leaf_count += 1;
<a name="l00135"></a>00135     }
<a name="l00136"></a>00136 };
<a name="l00137"></a>00137 
<a name="l00138"></a>00138 <span class="comment">// collect octants from a kd-tree</span>
<a name="l00139"></a>00139 <span class="keyword">template</span> &lt;u<span class="keywordtype">int</span>32 BLOCK_SIZE&gt;
<a name="l00140"></a>00140 __global__ <span class="keywordtype">void</span> collect_octants_kernel(
<a name="l00141"></a>00141     <span class="keyword">const</span> uint32        grid_size,
<a name="l00142"></a>00142     <span class="keyword">const</span> <a class="code" href="structnih_1_1_bintree__node.html">Kd_node</a>*      kd_nodes,
<a name="l00143"></a>00143     <span class="keyword">const</span> uint32        in_tasks_count,
<a name="l00144"></a>00144     <span class="keyword">const</span> <a class="code" href="structnih_1_1cuda_1_1_bintree__gen__context_1_1_split__task.html">Split_task</a>*   in_tasks,
<a name="l00145"></a>00145     uint32*             out_tasks_count,
<a name="l00146"></a>00146     <a class="code" href="structnih_1_1cuda_1_1_bintree__gen__context_1_1_split__task.html">Split_task</a>*         out_tasks,
<a name="l00147"></a>00147     uint32*             out_nodes_count,
<a name="l00148"></a>00148     <a class="code" href="structnih_1_1_octree__node.html">Octree_node</a>*   out_nodes)
<a name="l00149"></a>00149 {
<a name="l00150"></a>00150     <span class="keyword">const</span> uint32 LOG_WARP_SIZE = 5;
<a name="l00151"></a>00151     <span class="keyword">const</span> uint32 WARP_SIZE = 1u &lt;&lt; LOG_WARP_SIZE;
<a name="l00152"></a>00152 
<a name="l00153"></a>00153     <span class="keyword">volatile</span> __shared__ uint32 warp_offset[ BLOCK_SIZE &gt;&gt; LOG_WARP_SIZE ];
<a name="l00154"></a>00154 
<a name="l00155"></a>00155     <span class="keyword">const</span> uint32 warp_tid = threadIdx.x &amp; (WARP_SIZE-1);
<a name="l00156"></a>00156     <span class="keyword">const</span> uint32 warp_id  = threadIdx.x &gt;&gt; LOG_WARP_SIZE;
<a name="l00157"></a>00157 
<a name="l00158"></a>00158     <span class="keyword">volatile</span> __shared__ uint32 sm_red[ BLOCK_SIZE * 2 ];
<a name="l00159"></a>00159     <span class="keyword">volatile</span> uint32* warp_red = sm_red + WARP_SIZE * 2 * warp_id;
<a name="l00160"></a>00160 
<a name="l00161"></a>00161     __shared__ uint32 sm_children[ BLOCK_SIZE * 8 ];
<a name="l00162"></a>00162     uint32* children = sm_children + threadIdx.x;
<a name="l00163"></a>00163 
<a name="l00164"></a>00164     <span class="comment">// loop through all logical blocks associated to this physical one</span>
<a name="l00165"></a>00165     <span class="keywordflow">for</span> (uint32 base_idx = blockIdx.x * BLOCK_SIZE;
<a name="l00166"></a>00166         base_idx &lt; in_tasks_count;
<a name="l00167"></a>00167         base_idx += grid_size)
<a name="l00168"></a>00168     {
<a name="l00169"></a>00169         <span class="keyword">const</span> uint32 task_id = threadIdx.x + base_idx;
<a name="l00170"></a>00170 
<a name="l00171"></a>00171         uint32 node;
<a name="l00172"></a>00172 
<a name="l00173"></a>00173         <a class="code" href="structnih_1_1octree__builder_1_1_octree__collection.html" title="Utility class to hold results of an octree collection step.">Octree_collection</a> result;
<a name="l00174"></a>00174         result.node_count = 0;
<a name="l00175"></a>00175         result.leaf_count = 0;
<a name="l00176"></a>00176         result.bitmask    = 0;
<a name="l00177"></a>00177 
<a name="l00178"></a>00178         <span class="comment">// check if the task id is in range, and if so try to collect its treelet</span>
<a name="l00179"></a>00179         <span class="keywordflow">if</span> (task_id &lt; in_tasks_count)
<a name="l00180"></a>00180         {
<a name="l00181"></a>00181             <span class="keyword">const</span> <a class="code" href="structnih_1_1cuda_1_1_bintree__gen__context_1_1_split__task.html">Split_task</a> in_task = in_tasks[ task_id ];
<a name="l00182"></a>00182 
<a name="l00183"></a>00183             node = in_task.m_node;
<a name="l00184"></a>00184 
<a name="l00185"></a>00185             <a class="code" href="structnih_1_1octree__builder_1_1_octree__collector.html">Octree_collector&lt;0,BLOCK_SIZE&gt;::find_children</a>(
<a name="l00186"></a>00186                 in_task.m_input,
<a name="l00187"></a>00187                 kd_nodes,
<a name="l00188"></a>00188                 &amp;result,
<a name="l00189"></a>00189                 children );
<a name="l00190"></a>00190         }
<a name="l00191"></a>00191 
<a name="l00192"></a>00192         <span class="comment">// allocate output nodes, output tasks, and write all leaves</span>
<a name="l00193"></a>00193         {
<a name="l00194"></a>00194             uint32 task_count = result.node_count - result.leaf_count;
<a name="l00195"></a>00195 
<a name="l00196"></a>00196             uint32 node_offset = cuda::alloc( result.node_count, out_nodes_count, warp_tid, warp_red, warp_offset + warp_id );
<a name="l00197"></a>00197             uint32 task_offset = cuda::alloc( task_count,        out_tasks_count, warp_tid, warp_red, warp_offset + warp_id );
<a name="l00198"></a>00198 
<a name="l00199"></a>00199             <span class="comment">// write the parent node</span>
<a name="l00200"></a>00200             <span class="keywordflow">if</span> (task_id &lt; in_tasks_count)
<a name="l00201"></a>00201                 out_nodes[ node ] = <a class="code" href="structnih_1_1_octree__node.html">Octree_node</a>( result.bitmask, node_offset );
<a name="l00202"></a>00202 
<a name="l00203"></a>00203             <span class="comment">// write out all outputs</span>
<a name="l00204"></a>00204             <span class="keywordflow">for</span> (uint32 i = 0; i &lt; result.node_count; ++i)
<a name="l00205"></a>00205             {
<a name="l00206"></a>00206                 <span class="keyword">const</span> uint32  kd_node_index = children[ i * BLOCK_SIZE ];
<a name="l00207"></a>00207                 <span class="keyword">const</span> <a class="code" href="structnih_1_1_kd__node.html">Kd_node</a> kd_node       = kd_nodes[ kd_node_index ];
<a name="l00208"></a>00208 
<a name="l00209"></a>00209                 <span class="keywordflow">if</span> (kd_node.<a class="code" href="structnih_1_1_kd__node.html#a25619b385e5688f1016f2959d35653df">is_leaf</a>() == <span class="keyword">false</span>)
<a name="l00210"></a>00210                     out_tasks[ task_offset++ ] = Split_task( node_offset, 0, 0, kd_node_index );
<a name="l00211"></a>00211                 <span class="keywordflow">else</span>
<a name="l00212"></a>00212                     out_nodes[ node_offset ] = <a class="code" href="structnih_1_1_octree__node.html">Octree_node</a>( kd_node.<a class="code" href="structnih_1_1_kd__node.html#a119a19feb6758c6b1259e65d9976cc67">get_child_offset</a>() );
<a name="l00213"></a>00213 
<a name="l00214"></a>00214                 node_offset++;
<a name="l00215"></a>00215             }
<a name="l00216"></a>00216         }
<a name="l00217"></a>00217     }
<a name="l00218"></a>00218 }
<a name="l00219"></a>00219 
<a name="l00220"></a>00220 <span class="comment">// collect octants from a kd-tree</span>
<a name="l00221"></a>00221 <span class="keyword">inline</span> <span class="keywordtype">void</span> collect_octants(
<a name="l00222"></a>00222     <span class="keyword">const</span> Kd_node*      kd_nodes,
<a name="l00223"></a>00223     <span class="keyword">const</span> uint32        in_tasks_count,
<a name="l00224"></a>00224     <span class="keyword">const</span> Split_task*   in_tasks,
<a name="l00225"></a>00225     uint32*             out_tasks_count,
<a name="l00226"></a>00226     Split_task*         out_tasks,
<a name="l00227"></a>00227     uint32*             out_nodes_count,
<a name="l00228"></a>00228     Octree_node*   out_nodes)
<a name="l00229"></a>00229 {
<a name="l00230"></a>00230     <span class="keyword">const</span> uint32 BLOCK_SIZE = 128;
<a name="l00231"></a>00231     <span class="keyword">const</span> <span class="keywordtype">size_t</span> max_blocks = thrust::detail::backend::cuda::arch::max_active_blocks(collect_octants_kernel&lt;BLOCK_SIZE&gt;, BLOCK_SIZE, 0);
<a name="l00232"></a>00232     <span class="keyword">const</span> <span class="keywordtype">size_t</span> n_blocks   = <a class="code" href="group__vectors.html#ga5809911d15c32de18955c59865379695">nih::min</a>( max_blocks, (in_tasks_count + BLOCK_SIZE-1) / BLOCK_SIZE );
<a name="l00233"></a>00233     <span class="keyword">const</span> <span class="keywordtype">size_t</span> grid_size  = n_blocks * BLOCK_SIZE;
<a name="l00234"></a>00234 
<a name="l00235"></a>00235     collect_octants_kernel&lt;BLOCK_SIZE&gt; &lt;&lt;&lt;n_blocks,BLOCK_SIZE&gt;&gt;&gt; (
<a name="l00236"></a>00236         grid_size,
<a name="l00237"></a>00237         kd_nodes,
<a name="l00238"></a>00238         in_tasks_count,
<a name="l00239"></a>00239         in_tasks,
<a name="l00240"></a>00240         out_tasks_count,
<a name="l00241"></a>00241         out_tasks,
<a name="l00242"></a>00242         out_nodes_count,
<a name="l00243"></a>00243         out_nodes );
<a name="l00244"></a>00244 
<a name="l00245"></a>00245     cudaThreadSynchronize();
<a name="l00246"></a>00246 }
<a name="l00247"></a>00247 
<a name="l00248"></a>00248 } <span class="comment">// namespace octree_builder</span>
<a name="l00249"></a>00249 
<a name="l00250"></a>00250 <span class="comment">// build an octree given a set of points</span>
<a name="l00251"></a>00251 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Integer&gt;
<a name="l00252"></a>00252 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Iterator&gt;
<a name="l00253"></a><a class="code" href="structnih_1_1_octree__builder.html#a54d263ca6cbb13cef60860aa19c2423a">00253</a> <span class="keywordtype">void</span> <a class="code" href="structnih_1_1_octree__builder.html#a54d263ca6cbb13cef60860aa19c2423a">Octree_builder&lt;Integer&gt;::build</a>(
<a name="l00254"></a>00254     <span class="keyword">const</span> <a class="code" href="structnih_1_1_bbox.html">Bbox3f</a>                           bbox,
<a name="l00255"></a>00255     <span class="keyword">const</span> Iterator                         points_begin,
<a name="l00256"></a>00256     <span class="keyword">const</span> Iterator                         points_end,
<a name="l00257"></a>00257     <span class="keyword">const</span> uint32                           max_leaf_size)
<a name="l00258"></a>00258 { 
<a name="l00259"></a>00259     <span class="keyword">typedef</span> <a class="code" href="structnih_1_1cuda_1_1_bintree__gen__context_1_1_split__task.html">cuda::Bintree_gen_context::Split_task</a> Split_task;
<a name="l00260"></a>00260 
<a name="l00261"></a>00261     <span class="keyword">const</span> uint32 n_points = uint32( points_end - points_begin );
<a name="l00262"></a>00262 
<a name="l00263"></a>00263     m_bbox = bbox;
<a name="l00264"></a>00264     need_space( m_codes, n_points );
<a name="l00265"></a>00265     need_space( *m_index, n_points );
<a name="l00266"></a>00266     need_space( *m_octree, (n_points / max_leaf_size) * 8 );
<a name="l00267"></a>00267     need_space( *m_leaves, n_points );
<a name="l00268"></a>00268 
<a name="l00269"></a>00269     <span class="comment">// compute the Morton code for each point</span>
<a name="l00270"></a>00270     thrust::transform(
<a name="l00271"></a>00271         points_begin,
<a name="l00272"></a>00272         points_begin + n_points,
<a name="l00273"></a>00273         m_codes.begin(),
<a name="l00274"></a>00274         <a class="code" href="structnih_1_1morton__functor.html">morton_functor&lt;Integer&gt;</a>( bbox ) );
<a name="l00275"></a>00275 
<a name="l00276"></a>00276     <span class="comment">// setup the point indices, from 0 to n_points-1</span>
<a name="l00277"></a>00277     thrust::copy(
<a name="l00278"></a>00278         thrust::counting_iterator&lt;uint32&gt;(0),
<a name="l00279"></a>00279         thrust::counting_iterator&lt;uint32&gt;(0) + n_points,
<a name="l00280"></a>00280         m_index-&gt;begin() );
<a name="l00281"></a>00281 
<a name="l00282"></a>00282     <span class="comment">// sort the indices by Morton code</span>
<a name="l00283"></a>00283     <span class="comment">// TODO: use Duane&#39;s library directly here... this is doing shameful allocations!</span>
<a name="l00284"></a>00284     thrust::sort_by_key(
<a name="l00285"></a>00285         m_codes.begin(),
<a name="l00286"></a>00286         m_codes.begin() + n_points,
<a name="l00287"></a>00287         m_index-&gt;begin() );
<a name="l00288"></a>00288 
<a name="l00289"></a>00289     <span class="comment">// generate a kd-tree</span>
<a name="l00290"></a>00290     <a class="code" href="structnih_1_1cuda_1_1_bintree__context.html">cuda::Bintree_context</a> tree( m_kd_nodes, *m_leaves );
<a name="l00291"></a>00291 
<a name="l00292"></a>00292     <a class="code" href="group__bintree.html#gad76a50ae08ab4d525f748a7cbcc0fb6e">cuda::generate</a>(
<a name="l00293"></a>00293         m_kd_context,
<a name="l00294"></a>00294         n_points,
<a name="l00295"></a>00295         thrust::raw_pointer_cast( &amp;m_codes.front() ),
<a name="l00296"></a>00296         <a class="code" href="structnih_1_1octree__builder_1_1_morton__bits.html">octree_builder::Morton_bits&lt;Integer&gt;::value</a>,
<a name="l00297"></a>00297         max_leaf_size,
<a name="l00298"></a>00298         <span class="keyword">true</span>,
<a name="l00299"></a>00299         tree );
<a name="l00300"></a>00300 
<a name="l00301"></a>00301     m_leaf_count = m_kd_context.m_leaves;
<a name="l00302"></a>00302 
<a name="l00303"></a>00303     <span class="comment">// start building the octree</span>
<a name="l00304"></a>00304     thrust::device_vector&lt;Split_task&gt;* m_task_queues = m_kd_context.m_task_queues;
<a name="l00305"></a>00305     thrust::device_vector&lt;uint32&gt;&amp;     m_counters    = m_kd_context.m_counters;
<a name="l00306"></a>00306 
<a name="l00307"></a>00307     need_space( m_task_queues[0], n_points );
<a name="l00308"></a>00308     need_space( m_task_queues[1], n_points );
<a name="l00309"></a>00309 
<a name="l00310"></a>00310     Split_task* task_queues[2] = {
<a name="l00311"></a>00311         thrust::raw_pointer_cast( &amp;(m_task_queues[0]).front() ),
<a name="l00312"></a>00312         thrust::raw_pointer_cast( &amp;(m_task_queues[1]).front() )
<a name="l00313"></a>00313     };
<a name="l00314"></a>00314 
<a name="l00315"></a>00315     uint32 in_queue  = 0;
<a name="l00316"></a>00316     uint32 out_queue = 1;
<a name="l00317"></a>00317 
<a name="l00318"></a>00318     <span class="comment">// convert the kd-tree into an octree.</span>
<a name="l00319"></a>00319     need_space( m_counters, 3 );
<a name="l00320"></a>00320     m_counters[ in_queue ]  = 1;
<a name="l00321"></a>00321     m_counters[ out_queue ] = 0;
<a name="l00322"></a>00322     m_counters[ 2 ]         = 1; <span class="comment">// output node counter</span>
<a name="l00323"></a>00323 
<a name="l00324"></a>00324     m_task_queues[ in_queue ][0] = Split_task( 0, 0, 0, 0 );
<a name="l00325"></a>00325 
<a name="l00326"></a>00326     uint32 level = 0;
<a name="l00327"></a>00327     m_levels[ level++ ] = 0;
<a name="l00328"></a>00328 
<a name="l00329"></a>00329     <span class="comment">// loop until there&#39;s tasks left in the input queue</span>
<a name="l00330"></a>00330     <span class="keywordflow">while</span> (m_counters[ in_queue ])
<a name="l00331"></a>00331     {
<a name="l00332"></a>00332         m_levels[ level++ ] = m_counters[2];
<a name="l00333"></a>00333 
<a name="l00334"></a>00334         need_space( *m_octree, m_counters[2] + m_counters[ in_queue ]*8 );
<a name="l00335"></a>00335 
<a name="l00336"></a>00336         <span class="comment">// clear the output queue</span>
<a name="l00337"></a>00337         m_counters[ out_queue ] = 0;
<a name="l00338"></a>00338         cudaThreadSynchronize();
<a name="l00339"></a>00339 
<a name="l00340"></a>00340         octree_builder::collect_octants(
<a name="l00341"></a>00341             thrust::raw_pointer_cast( &amp;m_kd_nodes.front() ),
<a name="l00342"></a>00342             m_counters[ in_queue ],
<a name="l00343"></a>00343             task_queues[ in_queue ],
<a name="l00344"></a>00344             thrust::raw_pointer_cast( &amp;m_counters.front() ) + out_queue,
<a name="l00345"></a>00345             task_queues[ out_queue ],
<a name="l00346"></a>00346             thrust::raw_pointer_cast( &amp;m_counters.front() ) + 2,
<a name="l00347"></a>00347             thrust::raw_pointer_cast( &amp;m_octree-&gt;front() ) );
<a name="l00348"></a>00348 
<a name="l00349"></a>00349         <span class="keyword">const</span> uint32 out_queue_size = m_counters[ out_queue ];
<a name="l00350"></a>00350 
<a name="l00351"></a>00351         <span class="comment">// swap the input and output queues</span>
<a name="l00352"></a>00352         std::swap( in_queue, out_queue );
<a name="l00353"></a>00353 
<a name="l00354"></a>00354         <span class="keyword">const</span> uint32 n_nodes = m_counters[2];
<a name="l00355"></a>00355     }
<a name="l00356"></a>00356     m_node_count = m_counters[2];
<a name="l00357"></a>00357 
<a name="l00358"></a>00358     <span class="keywordflow">for</span> (; level &lt; 64; ++level)
<a name="l00359"></a>00359         m_levels[ level ] = m_node_count;
<a name="l00360"></a>00360 }
<a name="l00361"></a>00361 
<a name="l00362"></a>00362 } <span class="comment">// namespace nih</span>
</pre></div></div>
</div>
  <div id="nav-path" class="navpath">
    <ul>
      <li class="navelem"><b>octree_builder_inline.h</b>      </li>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>


    <li class="footer">Generated on Thu Dec 15 2011 11:56:19 for nih by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.5.1 </li>
   </ul>
 </div>


</body>
</html>
